Analysis on disconnected sets
نویسنده
چکیده
Very often in analysis, one focuses on connected spaces. This is certainly not always the case, and in particular there are many interesting matters related to Cantor sets. Here we are more concerned with a type of complementary situation. As a basic scenario, suppose that U is an open set in Rn and that E is a closed set contained in the boundary of U such that for every x ∈ U and r > 0 there is a connected component of U contained in the ball with center x and radius r. For instance, E might be the boundary of U . As a uniform version of the condition, one might ask that there be a constant C > 0 such that the aforementioned connected component of U contains a ball of radius C r. The connected components of U might be quite regular, even if there are infinitely many of them. As a basic example, E could be a Cantor set in the real line, and U could be the complement of E or the union of the bounded complementary components of E. This does not work in higher dimensions, where the complement of a Cantor set is connected. Sierpinski gaskets and carpets in the plane are very interesting cases where E is connected. One could also consider more abstract versions of this, in metric spaces, for instance. The open set U could be discrete, and the limiting set E could be arbitrary. Let us restrict our attention to the case where the closure of U is compact and E = ∂U . Consider Bergman spaces of locally constant functions on U , which can be identified with l spaces. Toeplitz operators associated to continuous functions on U can be defined in the usual way, by multiplying and projecting. The Toeplitz operators associated to functions vanishing on the boundary are compact. Thus, modulo compact operators, it is really the functions on the boundary that are important. Invertible functions on the boundary correspond to Fredholm operators, but their indices are automatically equal to 0. Of course, these are well-known themes.
منابع مشابه
A New Scalarization Technique to Approximate Pareto Fronts of Problems with Disconnected Feasible Sets
We introduce and analyze a novel scalarization technique and an associated algorithm for generating an approximation of the Pareto front (i.e., the efficient set) of nonlinear multiobjective optimization problems. Our approach is applicable to nonconvex problems, in particular to those with disconnected Pareto fronts and disconnected domains (i.e., disconnected feasible sets). We establish the ...
متن کاملAn efficient procedure for the avoidance of disconnected incomplete block designs
Knowledge of the cardinality and the number of minimal rank reducing observation sets in experimental design is important information which makes a useful contribution to the statistician’s tool-kit to assist in the selection of incomplete block designs. Its prime function is to guard against choosing a design that is likely to be altered to a disconnected eventual design if observations are lo...
متن کاملAlternated Julia Sets and Connectivity Properties
In this paper we present the alternated Julia sets, obtained by alternated iteration of two maps of the quadratic family 2 1 , 1,2 n n i z z c i and prove analytically and computationally that these sets can be connected, disconnected or totally disconnected verifying the known Fatou-Julia theorem in the case of polynomials of degree greater than two. A few examples are presented.
متن کاملDisconnected Vertex Sets and Equidistant Code Pairs
Two disjoint subsets A and B of a vertex set V of a finite graph G are called disconnected if there is no edge between A and B. If V is the set of words of length n over an alphabet {1, . . . , q} and if two words are adjacent whenever their Hamming distance is not equal to a fixed δ ∈ {1, . . . , n}, then a pair of disconnected sets becomes an equidistant code pair. For disconnected sets A and...
متن کاملPlane Continua and Totally Disconnected Sets of Buried Points
It is shown that there is a continuum in the plane whose set of buried points is totally disconnected and weakly 1-dimensional, but not zerodimensional. This answers a problem of Curry, Mayer and Tymchatyn.
متن کاملThe specification of rank reducing observation sets in experimental design
If observations are lost from an experiment involving one or more forms of blocking, it can happen that the resultant design is treatment disconnected which has serious implications for the experiment. A method is described in this paper for specifying each set of observations which has the property that a treatment disconnected design will result if this observation set is missing. Some implic...
متن کامل